Counting primes in residue classes
نویسندگان
چکیده
منابع مشابه
Counting primes in residue classes
We explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing π(x) can be used for computing efficiently π(x, k, l), the number of primes congruent to l modulo k up to x. As an application, we computed the number of prime numbers of the form 4n ± 1 less than x for several values of x up to 1020 and found a new region where π(x, 4, 3) is less than π(x, 4, 1) near x = 1018.
متن کاملExplicit bounds for primes in residue classes
Let E/K be an abelian extension of number fields, with E 6= Q. Let ∆ and n denote the absolute discriminant and degree of E. Let σ denote an element of the Galois group of E/K. We prove the following theorems, assuming the Extended Riemann Hypothesis: (1) There is a degree-1 prime p of K such that ( p E/K ) = σ, satisfying Np ≤ (1 + o(1))(log ∆ + 2n)2. (2) There is a degree-1 prime p of K such ...
متن کاملProducts in Residue Classes
Abstract. We consider a problem of P. Erdős, A. M. Odlyzko and A. Sárkőzy about the representation of residue classes modulom by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results “on average” over moduli m and residue classes modulo m and somewhat strong...
متن کاملCounting primes, groups, and manifolds.
Let Lambda=SL(2)(Z) be the modular group and let c(n)(Lambda) be the number of congruence subgroups of Lambda of index at most n. We prove that lim(n--> infinity )(log c(n)(Lambda)/((log n)(2)/log log n))=(3-2(sqrt)2)/4. The proof is based on the Bombieri-Vinogradov "Riemann hypothesis on the average" and on the solution of a new type of extremal problem in combinatorial number theory. Similar ...
متن کاملDivisors in residue classes, constructively
Let r, s, n be integers satisfying 0 ≤ r < s < n, s ≥ n, α > 1/4, and gcd(r, s) = 1. Lenstra showed that the number of integer divisors of n equivalent to r (mod s) is upper bounded by O((α − 1/4)). We re-examine this problem; showing how to explicitly construct all such divisors and incidentally improve this bound to O((α−1/4)−3/2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2004
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-04-01649-7